Search results for "EM algorithm"
showing 2 items of 2 documents
Classification of spatio-temporal point pattern in the presence of clutter using K-th nearest neighbour distances
2019
In a point process spatio-temporal framework, we consider the problem of features detection in the presence of clutters. We extend the methodology of Byers and Raftery (1998) to the spatio-temporal context by considering the properties of the K-th nearest-neighbour distances. We make use of the spatio-temporal distance based on the Euclidean norm where the temporal term is properly weighted. We show the form of the probability distributions of such K-th nearest-neighbour distance. A mixture distribution, whose parameters are estimated with an EM algorithm, is used to classify points into clutters or features. We assess the performance of the proposed approach with a simulation study, togeth…
Spatio‐temporal classification in point patterns under the presence of clutter
2019
We consider the problem of detection of features in the presence of clutter for spatio-temporal point patterns. In previous studies, related to the spatial context, Kth nearest-neighbor distances to classify points between clutter and features. In particular, a mixture of distributions whose parameters were estimated using an expectation-maximization algorithm. This paper extends this methodology to the spatio-temporal context by considering the properties of the spatio-temporal Kth nearest-neighbor distances. For this purpose, we make use of a couple of spatio-temporal distances, which are based on the Euclidean and the maximum norms. We show close forms for the probability distributions o…